A model-theoretic coreference scoring scheme
نویسندگان
چکیده
This note describes a scoring scheme for the coreference task in MUC6 . It improves o n the original approach l by: (1) grounding the scoring scheme in terms of a model ; (2) producing more intuitive recall and precision scores ; and (3) not requiring explici t computation of the transitive closure of coreference . The principal conceptual differenc e is that we have moved from a syntactic scoring model based on following coreferenc e links to an approach defined by the model theory of those links .
منابع مشابه
Description of the UPENN CAMP System as Used for Coreference
Scoring the performance of a system is an extremely important aspect of coreference algorithm performance. The score for a particular run is the single strongest measure of how well the system is performing and it can strongly determine directions for further improvements. In this paper, we present several di erent scoring algorithms and detail their respective strengths and weaknesses for vary...
متن کاملDesign and Enhanced Evaluation of a Robust Anaphor Resolution Algorithm
Syntactic coindexing restrictions are by now known to be of central importance to practical anaphor resolution approaches. Since, in particular due to structural ambiguity, the assumption of the availability of a unique syntactic reading proves to be unrealistic, robust anaphor resolution relies on techniques to overcome this deficiency. This paper describes the ROSANA approach, which generaliz...
متن کاملPrune-and-Score: Learning for Greedy Coreference Resolution
We propose a novel search-based approach for greedy coreference resolution, where the mentions are processed in order and added to previous coreference clusters. Our method is distinguished by the use of two functions to make each coreference decision: a pruning function that prunes bad coreference decisions from further consideration, and a scoring function that then selects the best among the...
متن کاملAlgorithms for Scoring Coreference Chains
Scoring the performance of a system is an extremely important aspect of coreference algorithm performance. The score for a particular run is the single strongest measure of how well the system is performing and it can strongly determine directions for further improvements. In this paper, we present several diierent scoring algorithms and detail their respective strengths and weaknesses for vary...
متن کاملScoring Coreference Partitions of Predicted Mentions: A Reference Implementation
The definitions of two coreference scoring metrics- B3 and CEAF-are underspecified with respect to predicted, as opposed to key (or gold) mentions. Several variations have been proposed that manipulate either, or both, the key and predicted mentions in order to get a one-to-one mapping. On the other hand, the metric BLANC was, until recently, limited to scoring partitions of key mentions. In th...
متن کامل